Universal extensions to simulate specifications

نویسنده

  • Wim H. Hesselink
چکیده

A previous paper introduced eternity variables as an alternative to the prophecy variables of Abadi and Lamport and proved the formalism to be semantically complete: every simulation F : K −. L that preserves quiescence contains a composition of a history extension, an extension with eternity variables, and a refinement mapping. This result is strengthened here in three ways. Firstly, the assumption of preservation of quiescence is eliminated. Secondly, it is shown that the intermediate extension only depends on K, and is independent of L and F . Thirdly, in order to accommodate implementation relations where the concrete specification (occasionally) does fewer steps than the abstract specification, we weaken the concept of simulation, in such a way that it precisely corresponds to the implementation concept of Abadi and Lamport. We add stuttering history extensions to the repertoire of variable extensions, and show that this extended repertoire suffices to factorize an arbitrary (weakened) simulation. The proofs have been verified with the theorem prover PVS. The methodology of using eternity extensions in correctness proofs is briefly discussed.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Universal Central Extension of Current Superalgebras

Representation as well as central extension are two of the most important concepts in the theory of Lie (super)algebras. Apart from the interest of mathematicians, the attention of physicist are also drawn to these two subjects because of the significant amount of their applications in Physics. In fact for physicists, the study of projective representations of Lie (super)algebras  are very impo...

متن کامل

A Constructive Proof of the Turing Completeness of Circal

This paper gives a proof of the Turing completeness of the Circal process algebra by exhibiting a universal program capable of mapping any Turing machine description into Circal specifications that effectively simulate the behaviour of the given machine.

متن کامل

Object-Oriented Analysis, Modeling, and Simulation of a Notional Air Defense System

This paper describes the analysis, modeling, and simulation of a notional air defense system using SMOOCHES (State Machines for Object-Oriented, Concurrent, Hierarchical Engineering Specifications). SMOOCHES is an object-oriented environment based on hierarchical state machines and extensions to Statecharts, specifically developed as an environment to specify, model, simulate and analyze / eval...

متن کامل

Optimizing the Static and Dynamic Scheduling problem of Automated Guided Vehicles in Container Terminals

The Minimum Cost Flow (MCF) problem is a well-known problem in the area of network optimisation. To tackle this problem, Network Simplex Algorithm (NSA) is the fastest solution method. NSA has three extensions, namely Network Simplex plus Algorithm (NSA+), Dynamic Network Simplex Algorithm (DNSA) and Dynamic Network Simplex plus Algorithm (DNSA+). The objectives of the research reported in this...

متن کامل

SUSY Les Houches Accord: Interfacing SUSY Spectrum Calculators, Decay Packages, and Event Generators

An accord specifying a unique set of conventions for supersymmetric extensions of the Standard Model together with generic file structures for 1) supersymmetric model specifications and input parameters, 2) electroweak scale supersymmetric mass and coupling spectra, and 3) decay tables is presented, to provide a universal interface between spectrum calculation programs, decay packages, and high...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Inf. Comput.

دوره 206  شماره 

صفحات  -

تاریخ انتشار 2008